Evolutionary Computation for Dynamic Capacitated Arc Routing Problem

In this chapter, a new dynamic capacitated arc routing problem (CARP) is defined and investigated. Compared with the static CARP and other dynamic CARP investigated by the existing researches, the new dynamic CARP is more general and closer to reality, and thus is more worthwhile to be solved. Due to the stochastic factors included in the dynamic CARP, the objective is not to obtain the optimal solution in a specific environment, but to find a robust solution that shows good performance in all the possible environments. For the dynamic CARP, a robustness measure based on repair operator is defined. The corresponding repair operator is designed according to the real-world considerations. Then, the benchmark instances of the dynamic CARP are generated by extending from the static counterparts to facilitate evaluating potential approaches. After that, the preliminary analysis for the fitness landscape of the dynamic CARP is conducted by experimental studies. Yi Mei School of Computer Science and Information Technology, RMIT University, Melbourne VIC 3001, Australia e-mail: [email protected] Ke Tang Nature Inspired Computation and Applications Laboratory (NICAL), School of Computer Science, University of Science and Technology of China, Hefei 230027, China e-mail: [email protected] Xin Yao Nature Inspired Computation and Applications Laboratory (NICAL), The USTCBirmingham Joint Research Institute in Intelligent Computation and Its Applications (UBRI), School of Computer Science, University of Science and Technology of China, Hefei 230027, China, and Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Birmingham, Birmingham B15 2TT, U.K. e-mail: [email protected] S. Yang and X. Yao (Eds.): Evolutionary Computation for DOPs, SCI 490, pp. 377–401. DOI: 10.1007/978-3-642-38416-5_15 c © Springer-Verlag Berlin Heidelberg 2013 378 Y. Mei, K. Tang, and X. Yao